Cramér–Rao Bounds and Optimal Design Metrics for Pose-Graph SLAM
نویسندگان
چکیده
Two-dimensional (2-D)/3-D pose-graph simultaneous localization and mapping (SLAM) is a problem of estimating set poses based on noisy measurements relative rotations translations. This article focuses the relation between graphical structure SLAM Fisher information matrix (FIM), Cramér-Rao lower bounds (CRLB), its optimal design metrics (T-optimality D-optimality). As main contribution, assumption isotropic Langevin noise for rotation block-isotropic Gaussian translation, FIM CRLB are derived shown to be closely related graph structure, in particular, weighted Laplacian matrix. We also prove that total node degree number spanning trees, as two connectivity metrics, are, respectively, trace determinant FIM. The discussions show that, compared with D-optimality metric, T-optimality metric more easily computed but less effective. present upper which can efficiently almost independent estimation results. results verified several well-known datasets, such Intel, KITTI, sphere, so on.
منابع مشابه
Pose Graph Compression for Laser-Based SLAM
The pose graph is a central data structure in graph-based SLAM approaches. It encodes the poses of the robot during data acquisition as well as spatial constraints between them. The size of the pose graph has a direct influence on the runtime and the memory requirements of a SLAM system since it is typically used to make data associations and within the optimization procedure. In this paper, we...
متن کاملPose-Graph SLAM for Underwater Navigation
This chapter reviews the concept of pose-graph simultaneous localization and mapping (SLAM) for underwater navigation. We show that pose-graph SLAM is a generalized framework that can be applied to many diverse underwater navigation problems in marine robotics. We highlight three specific examples as applied in the areas of autonomous ship hull inspection and multi-vehicle cooperative navigation.
متن کاملElasticFusion: Dense SLAM Without A Pose Graph
We present a novel approach to real-time dense visual SLAM. Our system is capable of capturing comprehensive dense globally consistent surfel-based maps of room scale environments explored using an RGB-D camera in an incremental online fashion, without pose graph optimisation or any postprocessing steps. This is accomplished by using dense frame-tomodel camera tracking and windowed surfel-based...
متن کاملDelayed Optimisation for Robust and Linear Pose-Graph SLAM
This paper addresses a robust and efficient solution to eliminate false loop-closures in a posegraph linear SLAM problem. Linear SLAMwas recently demonstrated based on submap joining techniques in which a nonlinear coordinate transformation was performed separately out of the optimisation loop, resulting in a convex optimisation problem. This however introduces added complexity in dealing with ...
متن کاملDetecting the correct graph structure in pose graph SLAM
While graph-based representations allow an efficient solution to the SLAM problem posing it as a non-linear least squares optimization, they require additional methods to detect and eliminate outliers. It is necessary to obtain the correct structure of the graph representing the SLAM problem which is topologically correct and will lead to a metric correct solution once optimized. In the graph-S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Robotics
سال: 2021
ISSN: ['1552-3098', '1941-0468', '1546-1904']
DOI: https://doi.org/10.1109/tro.2020.3001718